On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Information
نویسنده
چکیده
We identify three classes of four-state paraconsistent logics according to their different approaches towards the disjunctive syllogism, and investigate three representatives of these approaches: Quasiclassical logic, which always accepts this principle, Belnap’s logic, that rejects the disjunctive syllogism altogether, and a logic of inconsistency minimization that restricts its application to consistent fragments only. These logics are defined in a syntactic and a semantic style, which are linked by a simple transformation. It is shown that the three formalisms accommodate knowledge minimization, and that the most liberal formalism towards the disjunctive syllogism is also the strongest among the three, while the most cautious logic is the weakest one.
منابع مشابه
Paraconsistent Relational Model: A Quasi-Classic Logic Approach
The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the parac...
متن کاملA Routley-meyer Semantics for Ackermann’s Logics of “strenge Implikation”
The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π′ and Π′′. Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π′ and Π′′ are proved. A brief discussion on Π′, Π′′ and paraconsistency is included.
متن کاملA Semantic Tableau Version of First-Order Quasi-Classical Logic
Quasi-classical logic (QC logic) allows the derivation of non-trivial classical inferences from inconsistent information. A paraconsis-tent, or non-trivializable, logic is, by necessity, a compromise, or weakening , of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, the connectives behave in ...
متن کاملParaconsistent Stable Semantics for Extended Disjunctive Programs
This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new xpoint semantics of extende...
متن کاملHandling Inconsistency in Knowledge Bases
Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...
متن کامل